Lifting (D)QBF Preprocessing and Solving Techniques to (D)SSAT

Dependency stochastic Boolean satisfiability (DSSAT) generalizes (SSAT) in existential variables being Henkinized allowing their dependencies on randomized to be explicitly specified. It allows NEXPTIME problems of reasoning under uncertainty and partial information compactly encoded. To date, no decision procedure has been implemented for solving DSSAT formulas. This work provides the first such tool by converting into SSAT with dependency elimination, similar quantified formula (DQBF) (QBF). Moreover, we extend (D)QBF preprocessing techniques implement standalone (D)SSAT preprocessor. Experimental results show that via elimination is highly applicable existing solvers may benefit from preprocessing.